Maximal Models of Assertion Graph in GSTE

A Transformation-Based Approach to Implication of GSTE Assertion Graphs

Generalized symbolic trajectory evaluation (GSTE) is a model checking approach and has successfully demonstrated its powerful capacity in formal verification of VLSI systems. GSTE is an extension of symbolic trajectory evaluation (STE) to themodel checking of ω-regular properties. It is an alternative to classical model checking algorithms where properties are specified as finite-state automata...

Satgste: Combining the Abstraction of Gste with the Capacity of a Sat Solver

GSTE (Generalized Symbolic Trajectory Evaluation) is a model checking technique based on symbolic simulation 4]. GSTE is a very signiicant extension of STE 2], 3] that combines the eeciency, capacity and ease of use of STE with the ability of classic symbolic model checking for verifying a rich set of properties on very large HW designs. GSTE has vastly demonstrated its viability for full forma...

Reasoning about GSTE Assertion Graphs

Line graphs associated to the maximal graph

Let $R$ be a commutative ring with identity. Let $G(R)$ denote the maximal graph associated to $R$, i.e., $G(R)$ is a graph with vertices as the elements of $R$, where two distinct vertices $a$ and $b$ are adjacent if and only if there is a maximal ideal of $R$ containing both. Let $Gamma(R)$ denote the restriction of $G(R)$ to non-unit elements of $R$. In this paper we study the various graphi...

Global Forcing Number for Maximal Matchings under Graph Operations

Let $S= \{e_1,\,e_2‎, ‎\ldots,\,e_m\}$ be an ordered subset of edges of a connected graph $G$‎. ‎The edge $S$-representation of an edge set $M\subseteq E(G)$ with respect to $S$ is the‎ ‎vector $r_e(M|S) = (d_1,\,d_2,\ldots,\,d_m)$‎, ‎where $d_i=1$ if $e_i\in M$ and $d_i=0$‎ ‎otherwise‎, ‎for each $i\in\{1,\ldots‎ , ‎k\}$‎. ‎We say $S$ is a global forcing set for maximal matchings of $G$‎ ‎if $...